Performance of Novel Scheduling Strategies

Today distributed server systems have been widely used in many areas because they enhance the computing power while being cost-effective and more efficient. Meanwhile, some novel scheduling strategies are employed to optimize the task assignment process. This project closely explored the performance of the novel scheduling strategies through computer simulation. The research was carried out regarding the simulation of a novel scheduling policy (Task Assignment by Guessing Size) and other two previous task assignment policies (Random and JSQ). The performance of novel scheduling strategy (TAGS) is achieved by comparing TAGS policy with other two preceding policies. To facilitate the performance, computer simulation is applied to perform the statistical measurements. The findings were, indeed, very interesting, showing that the novel scheduling strategy (TAGS) merely obtains an optimal performance under heavy-tail distributed computing environment. The paper concludes by summarizing the findings from the simulation and suggesting a wider study be undertaking, in order to explore the performance of the novel strategy in more depth.